Communication Complexity of Simultaneous Messages
نویسندگان
چکیده
منابع مشابه
Communication Complexity of Simultaneous Messages
In the multiparty communication game (CFL-game) of Chandra, Furst, and Lipton (Proc. 15th ACM STOC, 1983, 94–99) k players collaboratively evaluate a function f(x0, . . . , xk−1) in which player i knows all inputs except xi. The players have unlimited computational power. The objective is to minimize communication. In this paper, we study the Simultaneous Messages (SM) model of multiparty commu...
متن کاملThe Communication Complexity of Private Simultaneous Messages, Revisited
Private Simultaneous Message (PSM) protocols were introduced by Feige, Kilian and Naor (STOC ’94) as a minimal non-interactive model for information-theoretic three-party secure computation. While it is known that every function f : {0, 1} × {0, 1} → {0, 1} admits a PSM protocol with exponential communication of 2 (Beimel et al., TCC ’14), the best known (non-explicit) lower-bound is 3k −O(1) b...
متن کاملSimultaneous Messages vs. Communication
In the multiparty communication game introduced by Chandra, Furst, and Lipton CFL] (1983), k players wish to evaluate collaboratively a function f (x0; : : : ; xk?1) for which player i sees all inputs except xi: The players have unlimited computational power. The objective is to minimize the amount of communication. We consider a restricted version of the multiparty communication game which we ...
متن کاملRandomized Simultaneous Messages: Solution of a Problem of Yao in Communication Complexity
We solve a 17 year old problem of Yao (FOCS 79). In the two-player communication model introduced by Yao in 1979, Alice and Bob wish to collaboratively evaluate a function in which Alice knows only input and Bob knows only input . Both players have unlimited computational power. The objective is to minimize the amount of communication. Yao (FOCS 79) also introduced an oblivious version of this ...
متن کاملSimultaneous Multiparty Communication Complexity of Composed Functions
The Number On the Forehead (NOF) model is a multiparty communication game between k players that collaboratively want to evaluate a given function F : X1 × · · · ×Xk → Y on some input (x1, . . . , xk) by broadcasting bits according to a predetermined protocol. The input is distributed in such a way that each player i sees all of it except xi (as if xi is written on the forehead of player i). In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2003
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539700375944